#include<iostream>
#include<algorithm>
using namespace std;
const int N = 1e5 + 10;
int st[N];
int arr[N];
int n, m;
int main()
{
	cin >> n >> m;
	for (int i = 0; i < n; i++) {
		cin >> arr[i];
		st[arr[i]]++;
	}
	sort(arr, arr + n);
	for (int i = 0; i < n; i++) {
		if (st[m - arr[i]] >= 2 && arr[i] * 2 == m) {
			cout << arr[i] << " " << m - arr[i] << endl;
			return 0;
		}
		else if (st[m - arr[i]] && arr[i] * 2 != m) {
			cout << arr[i] << " " << m - arr[i] << endl;
			return 0;
		}
	}
	cout << "No Solution" << endl;
	return 0;
}